Optimistic synchronization-based state-space reduction
نویسندگان
چکیده
منابع مشابه
Optimistic Synchronization-Based State-Space Reduction
Reductions that aggregate fine-grained transitions into coarser transitions can significantly reduce the cost of automated verification, by reducing the size of the state space. We propose a reduction that can exploit common synchronization disciplines, such as the use of mutual exclusion for accesses to shared data structures. Exploiting them using traditional reduction theorems requires check...
متن کاملAnalysis of Optimistic Window-based Synchronization
This paper studies an analytic model of parallel discrete-event simulation, comparing the costs and bene ts of extending optimistic processing to the YAWNS synchronization protocol. The basic model makes standard assumptions about workload and routing; we develop methods for computing performance as a function of the degree of optimism allowed, overhead costs of state-saving, rollback, and barr...
متن کاملOptimistic Barrier Synchronization
Barrier synchronization is a fundamental operation in parallel computation. In many contexts, at the point a processor enters a barrier it knows that it has already processed all work required of it prior to the synchronization. This paper treats the alternative case, when a processor cannot enter a barrier with the assurance that it has already performed all necessary pre-synchronization compu...
متن کاملSimplified synchronization through optimistic linearizability
We explore a novel programming model for multicore architectures in which shared data-structures are replicated per-thread. With a suitable mechanism for broadcasting data-structure operations (which may be wait-free or lock-free) there is no longer a need for elaborate, datastructure-specific synchronization (e.g. as seen in java.util.concurrent) at each replica. Moreover, threads can lazily a...
متن کاملTowards State Space Reduction Based on T-Lumpability-Consistent Relations
Markovian behavioral equivalences can be exploited for state space reduction before performance evaluation takes place. It is known that Markovian bisimilarity corresponds to ordinary lumpability and that Markovian testing and trace equivalences correspond to a coarser exact relation we call T-lumpability. While there exists an ordinarylumpability-consistent aggregation algorithm, this is not t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Methods in System Design
سال: 2006
ISSN: 0925-9856,1572-8102
DOI: 10.1007/s10703-006-0003-4